SPIRO L Mifsud

Select two points and add some obstacles -- then watch how Dijkstra's algorithm finds the shorte